#define _CRT_SECURE_NO_WARNINGS 1
#include"Sort.h"
int findPeakElement(int* nums, int numsSize) {
	int feni = 0;
	for (int i = 0; i < numsSize; i++)
	{
		if (i - 1 < 0)
		{
			if (nums[i] < nums[i + 1])
			{
				feni = i + 1;
			}
			else
			{
				feni = i;
			}
		}
		if (i + 1 >= numsSize)
		{
			if (nums[i - 1] < nums[i])
			{
				feni = i;
			}
			else
			{
				feni = i - 1;
			}
		}
		if ((i - 1 >= 0 && i + 1 < numsSize) && ((nums[i - 1] < nums[i] || nums[i - 1] > nums[i]) && (nums[i] > nums[i + 1] || nums[i] < nums[i + 1])))
		{
			if(nums[i] > nums[feni])
				feni = i;
		}
	}
	return feni;
}
void TestOP()
{
	srand((unsigned int)time(0));
	const int N = 10000000;
	int* a1 = (int*)malloc(sizeof(int) * N);
	int* a2 = (int*)malloc(sizeof(int) * N);
	int* a3 = (int*)malloc(sizeof(int) * N);
	int* a4 = (int*)malloc(sizeof(int) * N);
	int* a5 = (int*)malloc(sizeof(int) * N);
	int* a6 = (int*)malloc(sizeof(int) * N);
	int* a7 = (int*)malloc(sizeof(int) * N);
	for (int i = 0; i < N; ++i)
	{
		a1[i] = rand() + i;
		a2[i] = a1[i];
		a3[i] = a1[i];
		a4[i] = a1[i];
		a5[i] = a1[i];
		a6[i] = a1[i];
		a7[i] = a1[i];
	}
	int begin1 = clock();
	//InsertSort(a1, N);
	int end1 = clock();
	int begin2 = clock();
	//ShellSort(a2, N);
	int end2 = clock();
	int begin3 = clock();
	//SelectSort(a3, N);
	int end3 = clock();
	int begin4 = clock();
	//HeapSort(a4, N);
	int end4 = clock();
	int begin5 = clock();
	QuickSortNoR(a5, 0, N - 1);
	int end5 = clock();
	int begin6 = clock();
	MergeSortNoR(a6, N);
	int end6 = clock();
	int begin7 = clock();
	CountSort(a7, N);
	int end7 = clock();
	printf("InsertSort:%d\n", end1 - begin1);
	printf("ShellSort:%d\n", end2 - begin2);
	printf("SelectSort:%d\n", end3 - begin3);
	printf("HeapSort:%d\n", end4 - begin4);
	printf("QuickSort:%d\n", end5 - begin5);
	printf("MergeSort:%d\n", end6 - begin6);
	printf("CountSort:%d\n", end7 - begin7);
	free(a1);
	free(a2);
	free(a3);
	free(a4);
	free(a5);
	free(a6);
	free(a7);
}
int main()
{
	int arr[] = { 1,2,3,1 ,1,2,3,1 ,1,2,3,1 ,1,2,3,1 ,1,2,3,1 ,1,2,3,1 };
	int sz = sizeof(arr) / sizeof(arr[0]);
	TestOP();
	//QuickSort(arr, 0, sz - 1);
	//QuickSortNoR(arr, 0, sz - 1);
	//InsertSort(arr, sz);
	//MergeSort(arr, sz);
	//MergeSortNoR(arr, sz);
	//findPeakElement(arr, sz);
	//CountSort(arr, sz);
	//Print(arr, sz);
	return 0;
}
